Quickest Detection of Changes in Random Fields
نویسنده
چکیده
The quickest detection problem is formulated for processes defined on a two-dimensional lattice. Solutions are given when only the class of sequential probability ratio tests is considered.
منابع مشابه
Data-Efficient Quickest Change Detection
In the classical problem of quickest change detection, a decision maker observes a sequence of random variables. At some point in time, the distribution of the random variables changes abruptly. The objective is to detect this change in distribution with minimum possible delay, subject to a constraint on the false alarm rate. In many applications of quickest change detection, e.g., where the ch...
متن کاملQuickest Detection of Abrupt Changes for a Class of Random Processes
We consider the problem of quickest detection of abrupt changes for processes that are not necessarily independent and identically distributed (i.i.d.) before and after the change. By making a very simple observation that applies to most well-known optimum stopping times developed for this problem (in particular CUSUM and Shiryayev–Roberts stopping rule) we show that their optimality can be eas...
متن کاملQuickest Detection for Changes in Maximal kNN Coherence of Random Matrices
The problem of quickest detection of a change in the distribution of a n × p random matrix based on a sequence of observations having a single unknown change point is considered. The forms of the preand post-change distributions of the rows of the matrices are assumed to belong to the family of elliptically contoured densities with sparse dispersion matrices but are otherwise unknown. A non-par...
متن کاملQuickest Change Detection with Mismatched Post-Change Models
In this paper, we study the quickest change detection with mismatched post-change models. A change point is the time instant at which the distribution of a random process changes. The objective of quickest change detection is to minimize the detection delay of an unknown change point under certain performance constraints, such as average run length (ARL) to false alarm or probability of false a...
متن کاملDiscussion on “ Sequential Detection / Isolation of Abrupt Changes ” by Igor
In this interesting paper Professor Nikiforov reviewed the current state of quickest change detection/isolation problem. In our discussion of his paper we focus on the concerns and the opportunities of the subfield of quickest change detection, or more generally, sequential methodologies, in the modern
متن کامل